Transfer batch scheduling using genetic algorithms
نویسندگان
چکیده
منابع مشابه
Scheduling using Genetic Algorithms
We consider the scheduling of mixed task and data parallel modules comprising computation and communication operations. The program generation starts with a specification of the maximum degree of task and data parallelism of the method to be implemented. In several derivation steps, the degree of parallelism is adapted to a specific distributed memory machine. We present a scheduling derivation...
متن کاملScheduling batch processing: Genetic Algorithms Versus Mathematical Programming
Genetic algorithms have during the recent years gained popularity also in the domain of chemical engineering, among other applications for scheduling purposes. A genetic algorithm builds new sequences by combining and mutating previous sequences of genes, i.e. chromosomes, into a new set of chromosomes. In this new set, only the fittest survive, and the procedure is repeated. As a schedule in c...
متن کاملScheduling Courses using Genetic Algorithms
Preparation of courses at every university is done by hand. This method has limitations that often cause collisions schedule. In lectures and lab scheduling frequent collision against the faculty member teaching schedule, collisions on the class schedule and student, college collision course with lab time, the allocation of the use of the rooms were not optimal. Heuristic method of genetic algo...
متن کاملRole of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm
Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...
متن کاملImproved Multiprocessor Task Scheduling Using Genetic Algorithms
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to be a topic of considerable research. Approximate solutions to this NPcomplete problem typically combine search techniques and heuristics. Traditional solutions require a deterministic search of the solution space, which is computationally and temporally exhaustive. Genetic algorithms are known to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2008
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207540600920843